Skolemization, Most General Unifiers, First-Order Resolution Torsten Hahmann CSC 384, University of Toronto March 07, 2011

Source URL: www.cs.toronto.edu

• Model theory
• Logic
• Predicate logic
• Quantification
• Skolem normal form
• Inverse trigonometric functions
• Quantifier
• Surjective function
• Unification
• Herbrandization
• First-order logic

Universality Homomorphism order Locally injective homomorphisms Locally injective homomorphisms are universal on connected graphs

Source URL: www.ucw.cz

• Model theory
• Morphisms
• Functions and mappings
• Mathematical structures
• Universal algebra
• Homomorphism
• Structure
• Embedding
• Injective function
• Age
• Graph homomorphism

Fuzzy rough sets, fuzzy preorders and fuzzy topologies S.P. Tiwari Indian School of Mines, Dhanbad, India The relationship between rough set theory and topological spaces is wellknown. One central observation in

Source URL: irafm.osu.cz

• Order theory
• General topology
• Fuzzy logic
• Preorder
• Binary relation
• Topological space
• Rough set
• Closure operator
• Closure
• Kazimierz Kuratowski
• Alexandrov topology
• Fuzzy subalgebra

Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor) Scala-Virtualized: Linguistic Reuse for Deep Embeddings Tiark Rompf · Nada Amin · Adriaan Moors · Philipp Haller · Martin Odersky

Source URL: lampwww.epfl.ch

• Functional languages
• Object-oriented programming languages
• Order theory
• Scala
• Embedding
• Monad
• OCaml

Theory Question 3 Page 1 of 8 Theory Question 3 This question consists of five independent parts. Each of them asks for an estimate of an order of magnitude only, not for a precise answer. Enter all your answers into the

Source URL: www.jyu.fi

TERM EXTRACTION AND RAMSEY’S THEOREM FOR PAIRS ALEXANDER P. KREUZER AND ULRICH KOHLENBACH Abstract. In this paper we study with proof-theoretic methods the function(al)s provably recursive relative to Ramsey’s theore

Source URL: www.mathematik.tu-darmstadt.de

• Proof theory
• Computability theory
• Logic in computer science
• Mathematical logic
• Intuitionism
• Primitive recursive functional
• Dialectica interpretation
• Peano axioms
• Second-order arithmetic
• Reverse mathematics
• Combinatory logic
• Primitive recursive arithmetic

Dedekind-MacNeille completions of residuated lattices Joint work with A. Ciabattoni and K. Terui Nikolaos Galatos University of Denver June 6, 2009

Source URL: spot.colorado.edu

• Mathematics
• Algebra
• Abstract algebra
• Algebraic logic
• Lattice theory
• Mathematical logic
• Order theory
• Algebraic structures
• Heyting algebra
• Residuated lattice
• Boolean algebra
• DedekindMacNeille completion

A note on the Π02–induction rule∗ Ulrich Kohlenbach Fachbereich Mathematik, J.W.Goethe-Universit¨at, Robert-Mayer-Strasse 6–10, D–60054 Frankfurt, Germany Abstract It is well–known (due to C. Parsons) that th

Source URL: www.mathematik.tu-darmstadt.de

• Predicate logic
• Computability theory
• Recursion
• Logic
• Theory of computation
• Primitive recursive arithmetic
• Primitive recursive function
• Quantifier
• First-order logic
• Free variables and bound variables
• Herbrandization

BROWN’S LEMMA IN SECOND-ORDER ARITHMETIC EMANUELE FRITTAION Abstract. We show that Brown’s lemma is equivalent to IΣ02 over RCA∗0 . We also show that (the infinite) van der Waerden’s theorem is equivalent to BΣ

Source URL: www.math.tohoku.ac.jp

• Mathematics
• Ergodic theory
• Ramsey theory
• Semigroup theory
• Lemmas
• Combinatorics
• Piecewise syndetic set
• Partition regularity
• Syndetic set
• Diagonal lemma
• IP set
• BanachAlaoglu theorem

C:/Dokumente und Einstellungen/ulrich/Desktop/P1788/ArithOp2.dvi

Source URL: grouper.ieee.org

• Mathematics
• Interval
• Order theory
• Topology
• Computing
• Abstraction
• SSSE3
• SSE3